https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:50676 2) can be labeled with the integers from {1,...,|V|} and {1 respectively, in such a way that for every subgraph H isomorphic to a d-cube the sum of all the labels of H is the same. As a consequence, for every d ≥ 2, every d-dimensional grid graph is Q-supermagic where Q is the d-cube.]]> Tue 01 Aug 2023 15:12:45 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:1521 Sat 24 Mar 2018 08:30:52 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:1158 Sat 24 Mar 2018 08:28:43 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:10506 Sat 24 Mar 2018 08:08:28 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:27669 Sat 24 Mar 2018 07:38:50 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:34916 antimagic labeling of G admitting an H-covering is a bijective function f : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} such that, for all subgraphs H' of G isomorphic to H, the H'-weights, et_f(H') = Σ_υ∈V(H')f(υ)+Σ_e∈E(H')F(e), constitute an arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if f(V) = {1, 2, ..., ∣V∣}. In this paper, we study the existence of super (a, d)-H-antimagic labelings for graph operation G^H, where G is a (super) (b, d*)-edge-antimagic total graph and H is a connected graph of order at least 3.]]> Fri 06 Oct 2023 15:46:50 AEDT ]]>